A New Characterization of L-Convex Polygons
نویسنده
چکیده
In 1949 Horn and Valentine [HV] showed that if each pair of points a,b in a simple polygon P could be connected by a polygonal path of length two lying in P (such polygons are termed L-convex polygons) then through each point x in P there exists a line segment L(x) lying in P such that for every point y in P there exists a point z in L(x) with the property that the segment yz lies in P. Since the converse also holds true this is in fact a characterization of L-convex polygons. We show that by relaxing L(x) from a line-segment to a star-shaped subset S(x) of P containing x we obtain a new characterization of L-convex polygons if S(x) is constrained to be star-shaped from x, and a new class of polygons if it is not.
منابع مشابه
Making Polygons by Simple Folds and One Straight Cut
We give an efficient algorithmic characterization of simple polygons whose edges can be aligned onto a common line, with nothing else on that line, by a sequence of all-layers simple folds. In particular, such alignments enable the cutting out of the polygon and its complement with one complete straight cut. We also show that these makable polygons include all convex polygons possessing a line ...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملA method for the enumeration of various classes of column-convex polygons
2 Abstract. We present a new method that allows to enumerate various classes of column-convex polygons, according to their perimeter and their area. The rst step of this method leads to a functional equation which deenes implicitly the generating function of the class under consideration. The second step consists in solving this equation. We apply systematically our method to all the usual clas...
متن کاملOn k-convex polygons
We introduce a notion of k-convexity and explore polygons in the plane that have this property. Polygons which are k-convex can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard problem. We give a characterization of 2-convex polygons, a particularly interesting class, and show how to recognize them in O(n log n) time. A description of their sh...
متن کاملA Characterization of Affine Length and Asymptotic Approximation of Convex Discs
It is shown that every equi-affine invariant and upper semicontinuous valuation on the space of convex discs is a linear combination of the Euler characteristic, area, and affine length. Asymptotic formulae for approximation of convex discs by polygons are derived, extending results of L. Fejes Tóth from smooth convex discs to general convex discs. 1991 AMS subject classification: 52A10, 53A15,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007